Three-Step Derivative-Free Method of Order Six
نویسندگان
چکیده
Derivative-free iterative methods are useful to approximate the numerical solutions when given function lacks explicit derivative information or derivatives too expensive compute. Exploring convergence properties of such is crucial in their development. The behavior approaches and determining practical applicability require conducting local as well semi-local analysis. In this study, we explore a sixth-order derivative-free method. Previous studies assumed existence high order even method itself was not utilizing any derivatives. These assumptions imposed limitations on its applicability. paper, extend analysis by providing estimates for error bounds Consequently, expands across broader range problems. Moreover, more important challenging investigated earlier also developed. Additionally, survey recent advancements field. outcomes presented paper can be proved valuable practitioners researchers engaged development algorithms. Numerical tests illuminate validate further theoretical results.
منابع مشابه
On the construction of three step derivative free four-parametric methods with accelerated order of convergence
In this paper, a general procedure to develop some four-parametric with-memory methods to find simple roots of nonlinear equations is proposed. The new methods are improved extensions of with derivative without memory iterative methods. We used four self-accelerating parameters to boost up the convergence order and computational efficiency of the proposed methods without using any additional fu...
متن کاملA Class of Three-Step Derivative-Free Root Solvers with Optimal Convergence Order
A class of three-step eighth-order root solvers is constructed in this study. Our aim is fulfilled by using an interpolatory rational function in the third step of a three-step cycle. Each method of the class reaches the optimal efficiency index according to the Kung-Traub conjecture concerning multipoint iterative methods without memory. Moreover, the class is free from derivative calculation ...
متن کاملAn Optimally Convergent Three-step Class of Derivative-free Methods
In this paper, a new optimally convergent eighth-order class of three-step without memory methods is suggested. We here pursue derivative-free algorithms, i.e., algorithms requiring only the ability to evaluate the (objective) function. Since the types of problems that these algorithms can solve are extremely diverse in nature. The analysis of convergence shows that each derivative-free method ...
متن کاملDerivative free optimization method
Derivative free optimization (DFO) methods are typically designed to solve optimization problems whose objective function is computed by a “black box”; hence, the gradient computation is unavailable. Each call to the “black box” is often expensive, so estimating derivatives by finite differences may be prohibitively costly. Finally, the objective function value may be computed with some noise, ...
متن کاملA Six Step Block Method for Solution of Fourth Order Ordinary Differential Equations
A linear multistep method for solving first order initial value problems of ordinary differential equations is presented in this paper. The approach of collocation approximation is adopted in the derivation of the scheme and then the scheme is applied as simultaneous integrator to first order initial value problems of ordinary differential equations. This implementation strategy is more accurat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations
سال: 2023
ISSN: ['2673-9321']
DOI: https://doi.org/10.3390/foundations3030034